Approximating the Minimum Volume Bounding Box of a Point Set
نویسنده
چکیده
Isn’t it an artificial, sterilized, didactically pruned world, a mere sham world in which you cravenly vegetate, a world without vices, without passions without hunger, without sap and salt, a world without family, without mothers, without children, almost without women? The instinctual life is tamed by meditation. For generations you have left to others dangerous, daring, and responsible things like economics, law, and politics. Cowardly and well-protected, fed by others, and having few burdensome duties, you lead your drones’ lives, and so that they won’t be too boring you busy yourselves with all these erudite specialties, count syllables and letters, make music, and play the Glass Bead Game, while outside in the filth of the world poor harried people live real lives and do real work. The Glass Bead Game, Hermann Hesse
منابع مشابه
Bounds on the quality of the PCA bounding boxes
Principal component analysis (PCA) is commonly used to compute a bounding box of a point set in R. The popularity of this heuristic lies in its speed, easy implementation and in the fact that usually, PCA bounding boxes quite well approximate the minimumvolume bounding boxes. We present examples of discrete points sets in the plane, showing that the worst case ratio of the volume of the PCA bou...
متن کاملChapter 21 Approximating the Directional Width of a Shape
x " From the days of John the Baptist until now, the kingdom of heaven suffereth violence, and the violent bear it away. " – – Matthew 11:12 denote the directional width of P in the direction of v. A set Q ⊆ P is a ε-coreset for directional width, if ∀v ∈ S (d−1) ω(v, Q) ≥ (1 − ε)ω(v, P). Namely, the coreset Q provides a concise approximation to the directional width of P. The usefulness of suc...
متن کاملChapter 22 Approximating the Directional Width of a Shape
x " From the days of John the Baptist until now, the kingdom of heaven suffereth violence, and the violent bear it away. " – – Matthew 11:12 denote the directional width of P in the direction of v. A set Q ⊆ P is a ε-coreset for directional width, if ∀v ∈ S (d−1) ω(v, Q) ≥ (1 − ε)ω(v, P). Namely, the coreset Q provides a concise approximation to the directional width of P. The usefulness of suc...
متن کاملApproximating the Directional Width of a Shape
x " From the days of John the Baptist until now, the kingdom of heaven suffereth violence, and the violent bear it away. " – – Matthew 11:12 denote the directional width of P in the direction of v. A set Q ⊆ P is a ε-coreset for directional width, if ∀v ∈ S (d−1) ω(v, Q) ≥ (1 − ε)ω(v, P). Namely, the coreset Q provides a concise approximation to the directional width of P. The usefulness of suc...
متن کاملChapter 19 Approximating the Minimum Volume Bounding Box of a Point Set
Isn’t it an artificial, sterilized, didactically pruned world, a mere sham world in which you cravenly vegetate, a world without vices, without passions without hunger, without sap and salt, a world without family, without mothers, without children, almost without women? The instinctual life is tamed by meditation. For generations you have left to others dangerous, daring, and responsible thing...
متن کاملUpper and Lower Bounds on the Quality of the PCA Bounding Boxes
Principle component analysis (PCA) is commonly used to compute a bounding box of a point set in Rd . The popularity of this heuristic lies in its speed, easy implementation and in the fact that usually, PCA bounding boxes quite well approximate the minimum-volume bounding boxes. In this paper we give a lower bound on the approximation factor of PCA bounding boxes of convex polytopes in arbitrar...
متن کامل